Approximate Steiner (r − 1,r,n)‐systems without three blocks onr + 2 points

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Steiner 2-design with an Automorphism Fixing Exactly R + 2 Points

Doyen conjectured that there is no Steiner 2-design having an automorphism with more than r + 1 but fewer than r + p r ? 1 xed points, where r is the replication number. The falsity of this conjecture is shown by describing 2-(45,5,1) designs having an automorphism of order 2 with exactly 13 xed points.

متن کامل

Narrow-Shallow-Low-Light Trees with and without Steiner Points

We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists atree T that has small maximum degree, depth and weight. Moreover, for every point v ∈ S, the distancebetween rt and v in T is within a factor of (1+2) close to their Euclidean distance ‖rt, v‖. We call thesetrees narrow-shallow-low-light (NSLLTs). We demonstrate that our construction a...

متن کامل

Approximate Euclidean Steiner Trees

An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error from 120◦. This notion arises in numerical approximations of minimum Steiner trees. We investigate theworst-case relative error of the length of an approximate Steiner tree compared to the shortest tree with the same topology. It ha...

متن کامل

Defuzzification using Steiner points

A defuzzification function assigns to each fuzzy set a crisp value in a way that this value may intuitively be understood as the “centre” of the fuzzy set. In the present paper, this vague concept is put into a mathematically rigorous form. To this end, we proceed analogously to the case of sharply bordered subsets, for which the Steiner point is frequently used. The function assigning to each ...

متن کامل

Hamiltonian Tetrahedralizations with Steiner Points

A tetrahedralization of a point set in 3-dimensional space is Hamiltonian if its dual graph has a Hamiltonian cycle. Let S be a set of n points in general position in 3-dimensional space. We prove that by adding to S at most ⌊ 2 ⌋ Steiner points in the interior of the convex hull of S, we obtain a point set that admits a Hamiltonian tetrahedralization. We also obtain an O(m 3 2 ) + O(n log n) a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Designs

سال: 2019

ISSN: 1063-8539,1520-6610

DOI: 10.1002/jcd.21690